In this paper, some new properties of EQ-algebras are investigated. We intro-duce and study the notion of Boolean center of lattice ordered EQ-algebras with bottom element. We show that in a good ℓ EQ-algebra E with bottom element the complement of an element is unique. Furthermore, Boolean elements of a good bounded lattice EQ-algebra are characterized. Finally, we obtain conditions under which Boolean center of an EQ-algebra E is the subalgebra of E.

This paper presents a new method for simplification of Boolean functions based on Boolean differences. The proposed method is applicable to various forms of Boolean functions, including truth tables and Binary Decision Diagrams (BDDs). The Boolean differences are extended to cover the truth tables with don't-care components and cutset graphs in BDDs. The results of simplification agree with Quine-McCluskey and ESPRESSO methods. Experimental tests on MCNC and Berkeley PLA benchmarks show that the proposed method gains a performance of 1.5-10 times faster than ESPRESSO. The algorithms of the proposed method are implemented in Java/Perl/C++, and a toolset for logic function simplification is developed.

The main result of this paper is a characterization of the strongly algebraically closed algebras in the  lattice of all real-valued continuous functions and the equivalence classes of $\lambda$-measurable. We shall provide conditions  which strongly algebraically closed algebras carry a strictly positive Maharam submeasure. Particularly, it is proved that if $B$ is a strongly algebraically closed lattice  and $(B,\, \sigma)$ is a Hausdorff space  and $B$ satisfies  the   $G_\sigma$ property, then $B$ carries a strictly positive Maharam submeasure.

This paper introduces a novel concept of Boolean function{based hypergraph with respect to any given T. B. T(total binary truth table). This study de, nes a notation of kernel set on switching functions and proves that every T. B. T corresponds to a Minimum Boolean expression via kernel set and presents some conditions on T. B. T to obtain a Minimum irreducible Boolean expression from switching functions. Finally, we present an algorithm and so Python programming(with complete and original codes) such that for any given T. B. T, introduces a Minimum irreducible switching expression.